Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols

Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols

A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols

We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process the literals incrementally and to maintain at all times a set of random variable assignments that satisfy the literals seen so far. We prove that this algorithm is complete (i.e., i...

A Randomized Satisfiability Procedure for Arithmetic and Uninterpreted Function Symbols

We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process the literals incrementally and to maintain at all times a set of random variable assignments that satisfy the literals seen so far. We prove that this algorithm is complete (i.e., i...

Diophantine Equations, Presburger Arithmetic and Finite Automata

We show that the use of nite automata provides a decision procedure for Presburger Arithmetic with optimal worst case complexity.

Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic